The maximum flow problem: a real-time approach
نویسندگان
چکیده
منابع مشابه
The maximum flow problem: a real-time approach
The dynamic version of the maximum ow problem allows the graph underlying the ow network to change over time. The graph receives corrections to its structure or capacities and consequently the value of the maximum ow is modi ed. These corrections arrive in real time. In this paper, parallel and sequential solutions to the real-time maximum ow problem are developed on the Recon gurable Multiple ...
متن کاملImproved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem
Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields a ver>' simple algorithm nmning in 0{n^) time on n-vertex networks. Incorporation of the dynamic tree data structure of Sleator and Tarjan yields a more complicated algorithm with a running time of 0{rvn log {n^ Im)) on m-arc networks. Ahuja and Orlin developed a variant of Goldberg's algorithm ...
متن کاملA Maximum Flow Approach to the Volumetric Reconstruction Problem
We present a 3D reconstruction technique based on the maximum-flow formulation. Starting with a set of calibrated images, we globally search for the most probable 3D model given the photoconsistency and the spatial continuity constraints. This search is done radially from the center of the reconstruction volume; therefore imposing a radial topology. The fact that cameras are arbitrarily positio...
متن کاملThe maximum flow problem
In this network we have two special vertices: a source vertex s and a sink vertex t. Our goal is to send the maximum amount of flow from s to t; flow can only travel along arcs in the right direction, and is constrained by the arc capacities. This “flow” could be many things: imagine sending water along pipes, with the capacity representing the size of the pipe; or traffic, with the capacity be...
متن کاملImproved Time Bounds for the Maximum Flow Problem
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields a very simple algorithm running in O(n 3) time on n-vertex networks. Incorporation of the dynamic tree data structure of Sleator and Tarjan yields a more complicated algorithm with a running time of O(nm log (n 2/m)) on m-edge networks. Ahuja and Orlin developed a variant of Goldberg's algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2003
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(03)00022-x